Computational complexity theory

Results: 2049



#Item
21Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi  David García-Soriano

Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-Soriano

Add to Reading List

Source URL: www.francescobonchi.com

Language: English - Date: 2016-05-05 08:42:00
22Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c

Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c

Add to Reading List

Source URL: somchaya.org

Language: English - Date: 2014-05-05 11:44:38
23Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡  Martin J. Straussk

Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2006-09-25 10:55:42
24A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:31:39
25MSGIC Executive Committee Meeting Minutes January 8, 2016 9a.m. – 12p.m. Anne Arundel County Government, Heritage Complex (Annapolis, MD)  Attendees:

MSGIC Executive Committee Meeting Minutes January 8, 2016 9a.m. – 12p.m. Anne Arundel County Government, Heritage Complex (Annapolis, MD) Attendees:

Add to Reading List

Source URL: msgic.org

Language: English - Date: 2016-04-09 16:41:29
26On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1  Institute of Theoretical Computer Science and Center of Advancing

On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing

Add to Reading List

Source URL: korrekt.org

Language: English - Date: 2016-06-13 07:14:39
27ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-02-25 05:09:48
28CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-01-06 16:13:01
29CHAPTER 8  Algorithms for Data Streams CAMIL DEMETRESCU and IRENE FINOCCHI  8.1 INTRODUCTION

CHAPTER 8 Algorithms for Data Streams CAMIL DEMETRESCU and IRENE FINOCCHI 8.1 INTRODUCTION

Add to Reading List

Source URL: twiki.di.uniroma1.it

Language: English - Date: 2014-06-16 03:22:22
30Microsoft Word - orbs7180.doc

Microsoft Word - orbs7180.doc

Add to Reading List

Source URL: www.math.hkbu.edu.hk

Language: English - Date: 2013-09-27 05:04:48